An Efficient Dynamic Hash Index Structure for NAND Flash Memory

نویسندگان

  • Chul-Woong Yang
  • Ki Yong Lee
  • Myoung-Ho Kim
  • Yoon-Joon Lee
چکیده

We propose an efficient dynamic hash index structure suitable for a NAND flash memory environment. Since write operations incur significant overhead in NAND flash memory, our design of index structure focuses on minimizing the number of write operations for hash index updates. Through a set of extensive experiments, we show the effectiveness of the proposed hash index structure in a NAND flash memory environment. key words: NAND flash, dynamic hashing, index structure

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Forest: An Efficient Index Structure for NAND Flash Memory

In this paper, we present an efficient index structure for NAND flash memory, called the Dynamic Forest (D-Forest). Since write operations incur high overhead on NAND flash memory, D-Forest is designed to minimize write operations for index updates. The experimental results show that D-Forest significantly reduces write operations compared to the conventional B+-tree. key words: NAND flash memo...

متن کامل

μ-Tree : An Ordered Index Structure for NAND Flash Memory∗

As NAND flash memory becomes increasingly popular as data storage for embedded systems, many file systems and database management systems are being built on it. They require an efficient index structure to locate a particular item quickly from a huge amount of directory entries or database records. This paper proposes μ-Tree, a new ordered index structure tailored to the characteristics of NAND...

متن کامل

An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory

Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and nonevolatile properties, However, due to the very distinct characteristics of flash memory, disk based systems and applications may result in severe performance degradation when directly adopt...

متن کامل

An Efficient Metadata Index Structure for Flash File Systems

SUMMARY One way to use NAND flash memory as storage media is a flash file system. In order to design a high-performance flash file system , designing an efficient index structure that constitutes the locations of metadata including directories and files in flash memory is important. For large-capacity storage, the index structure must be stored in the flash memory to achieve low memory consumpt...

متن کامل

Reducing Computation Overhead of Flash Translation Layer with Hash

NAND flash memory does not support the overwrite operation and thus it deploys the flash translation layer which performs the out-place update. When designing a flash translation layer, memory consumption, computation complexity, and garbage collection overhead should be low. However, the representative sector mapping scheme of flash translation layer, FAST causes a huge computation complexity ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 92-A  شماره 

صفحات  -

تاریخ انتشار 2009